Data Matching Using Flow Based Packet Data Storage

ABSTRACT

A system for matching data using flow based packet data storage includes a communications interface and a processor. A communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet indicates a potential match to data in storage using hashes. The processor then stores the data from the most likely data match and second most likely data match without a packet header in a block of memory in the storage based on the flow.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 14/270,101, filed May 5, 2014 and entitled “Data Matching Using Flow Based Packet Data Storage,” which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 11/498,473 (now U.S. Pat. No. 8,755,381), filed Aug. 2, 2006, issued Jun. 17, 2014 and entitled “Data Matching Using Flow Based Packet Data Storage.” The above-referenced applications are incorporated herein by reference in their entirety including all references cited therein.

BACKGROUND

1. Technical Field

The present invention relates generally to data storage and communications and more particularly to data matching using flow based packet data storage.

2. Description of Related Art

For transmission over communications networks, data has been organized into packets, frames, and cells. Bundling data into these packets, frames, and cells assists routers and switches in the communication network to handle a manageable amount of data. Large amounts of data such as files may be separated into hundreds of packets. Thus, messages such as data requests or data responses for these large amounts of data may also span over hundreds of packets. When packets get misordered or retransmitted, reassembling the packets into the messages can be difficult and time consuming.

In some situations, incoming data needs to be matched with data stored in memory. In one example, in order to prevent redundancy and reduce communication bandwidth, a request for data is matched with data stored in local memory and retrieved from the memory without transmitting the request for data to retrieve the data over the communications network. However, matching the data may be problematic when the packets for related data are stored in different locations in the memory.

A Transmission Control Protocol (TCP) stack does reassemble and sort out packets. The TCP stack does handle packets destined to a socket and then sequentially stores the packets from the socket in pages of memory. The TCP stack also strips the header of the packet and transfers the payload data of the packet to the applications in the application layer. Ethernet switches and IP routers also perform flow based queuing, where packets for a flow are stored in queues. The packets for a flow may be organized on the same page of memory or by linked lists.

These protocols, switches, and routers may have stored packets in memory based on a flow to solve different problems such as buffering and queuing. However, none of the prior art systems have stored the packets in memory based on flow to match data.

SUMMARY OF THE INVENTION

The invention addresses the above problems by providing data matching by using flow based packet data storage. A system for processing packets includes a communications interface and a processor. The communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet matches to storage data in storage using hashes. If the packet data does not match the storage data, the processor then stores the packet data in a block of memory in the storage based on the flow.

The storage may comprise short term memory and long term memory. The flow may comprise a session between a source and a destination. The block of memory may comprise a page of the contiguous memory. In some embodiments, the processor computes the hashes for the flow. The processor may also determine the hashes for the flow and store the hashes for the flow. The hashes can be rolling.

A method for processing packets includes the steps of receiving a packet between a source and a destination and identifying a flow between the source and the destination based on the packet. The method also includes the step of determining whether packet data of the packet matches to storage data in storage using hashes. The method also includes storing the packet data in a block of memory in the storage based on the flow and if the packet data does not match the storage data.

The system advantageously provides an organization of data in memory by flow for easier matching of data through hashes and retrieval of that data. By storing the packets for a flow in the same block of memory, accessing the data for the flow is easier than having different flows interleaved with each other in memory. Also, data can be matched to data in the flow regardless of how data may have been separated into packets. Thus, any issues with packet boundaries for data are eliminated.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an illustration of a communications system in an exemplary implementation of the invention.

FIG. 2 is an illustration of communications in various forms in an exemplary implementation of the invention.

FIG. 3 is an illustration of messages, packets, and a block of memory that contain data in an exemplary implementation of the invention.

FIG. 4 is a flow chart for the network device that hashes data in an exemplary implementation of the invention.

FIG. 5 is a flow chart for the network device that matches data in an exemplary implementation of the invention.

FIG. 6 is a flow chart for the network device that writes data in an exemplary implementation of the invention.

FIG. 7 is a flow chart for the network device that retrieves data in an exemplary implementation of the invention.

FIG. 8 is a block diagram of the network device in an exemplary implementation of the invention.

DETAILED DESCRIPTION OF THE INVENTION

The embodiments discussed herein are illustrative of one example of the present invention. As these embodiments of the present invention are described with reference to illustrations, various modifications or adaptations of the methods and/or specific structures described may become apparent to those skilled in the art. All such modifications, adaptations, or variations that rely upon the teachings of the present invention, and through which these teachings have advanced the art, are considered to be within the scope of the present invention. Hence, these descriptions and drawings should not be considered in a limiting sense, as it is understood that the present invention is in no way limited to only the embodiments illustrated.

A system for processing packets includes a communications interface and a processor. A communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet matches to storage data in storage using hashes. The processor then stores the packet data in a block of memory in the storage based on the flow and if the packet data does not match the storage data.

The system advantageously provides an organization of data in memory by flow for easier matching of data through hashes and retrieval of that data. By storing the packets for a flow in the same block of memory, accessing the data for the flow is easier than having different flows interleaved with each other in memory. Also, data can be matched to data in the flow regardless of how data may have been separated into packets. Thus, any issues with packet boundaries for data are eliminated. The system can handle different types of data requests and responses and still match data within the packets.

The system minimizes delay by storing packets in a flow on a packet-by-packet basis. Thus, higher throughput is realized because the system does not have to wait for the next packet in the flow. As soon as packets are received, the system determines where to store the packet and whether to store the packet.

FIG. 1 depicts an illustration of a communications system 100 in an exemplary implementation of the invention. The communications system 100 includes a source 110, a network device 120, a communication network 130, a network device 140, and a destination 150. The source 110 is coupled to the network device 120, which includes a memory 122. The network device 120 is coupled to the communication network 130. The communication network 130 is coupled to the network device 140, which includes a memory 142. The network device 140 is coupled to the destination 150.

The embodiments in FIGS. 1-8 depict an example of packets being transmitted from the source 110 to the destination 150 through the network device 120, the communication network 130, and the network device 140. Other embodiments may include packets being transmitted from the destination 150 to the source 110. The network device 120 and the network device 140 may generate their own packets and be the source 110 and the destination 150. While there are numerous variations in where the packet is generated and transmitted to, the figures below describe one example of packet transmissions from the source 110 to the destination 150 for the sake of simplicity.

The network device 120 and the network device 140 are any device or system configured to process packets and exchange packets over the communication network 130. The configuration of the network device 120 is described in further detail below in FIG. 8. One example of the network device 120 is an appliance in a network memory architecture, which is described in U.S. patent application Ser. No. 11/202,697 (now U.S. Pat. No. 8,370,583) entitled “Network Memory Architecture for Providing Data Based on Local Accessibility” filed on Aug. 12, 2005 and issued on Feb. 5, 2013, which is hereby incorporated by reference.

FIG. 2 depicts an illustration of communications in various forms in an exemplary implementation 200 of the invention. The communications 210 include messages 212, messages 214, and messages 216. Some example of the messages 212, messages 214, and messages 216 are data requests and responses.

The communications 220 organized by flow include the flow A 222, flow B 224, and flow C 226. A flow is a communications session between two devices over a communications network. One example of a flow is an Internet Protocol (IP) flow. In one example, the flow is uniquely identified by the source IP address, the destination IP address, the IP protocol, the source port, and the destination port. The packets for a flow are advantageously stored in a same block of memory for easy retrieval and matching.

The memory 122 includes memory blocks 240 and flow state information 250. The memory 122 may comprise Random Access Memory (RAM), disk drives, hard disks, optical disks, and any of a combination of these elements. The memory 122 may comprise two levels of memory. One level is a more temporary or short term memory such as RAM, and the other level is a more permanent or long term memory such as disk. Typically, the temporary memory has faster read and write access than the slower read and write access of permanent memory.

The memory blocks 240 include block 1 242, block 2 244, and block 3 246. The memory blocks 240 are blocks of contiguous memory. A block of memory is a contiguous section or portion of memory.

FIG. 2 depicts how flow A 222 is stored into block 1 242 of the memory blocks 240. Also, flow B 224 is stored into block 2 244 of the memory blocks 240, and flow C 226 is stored into block 3 246 of the memory blocks 240. FIG. 2 shows how communications 210 are organized into flows, and how the flows are organized into blocks of memory. The figures below describe how the packets in the flows are stored into a specific block of memory blocks 240 based on flow.

The flow state information 250 is any data or information that relate to the characteristics, status, or state of the flow.

FIG. 3 depicts an illustration of messages, packets, and a block of memory that contain data in an exemplary implementation of the invention. A message A 310 contains data 312. The message A 310 is then separated into packets for communication. The message A 310 is delineated into packet A 320 and packet B 325. Only two packets for message A 310 are shown for the sake of simplicity. However, messages may be separated into numerous packets. The packet A 320 comprises a payload 321 and the header 323. The packet B 325 comprises a payload 326 and the header 328. The data 312 in message A 310 is separated into data 322 in the payload 321 of packet A 320 and data 327 in the payload 326 of packet B 325. As discussed above in FIG. 2, the data 322 and the data 327 are stored in a memory block 330 as data 332 without the headers 323 and 328. The data 332 is stored in the memory block 330 without any packet delineations so data with different packet boundaries can be matched to the data in the memory block 330.

Message B 340 includes data 342. The message B 340 also is then separated into packets for communication. The message B 340 is delineated into packet C 350 and packet D 355. The packet C 350 comprises a payload 351 and the header 353. The packet D 355 comprises a payload 356 and the header 358. The data 342 in message B 340 is separated into data 352 in the payload 351 of packet C 350 and data 357 in the payload 356 of packet D 355. Using hashes and storing states of hashes across packet boundaries as discussed in further detail below in FIGS. 4-6, the data 352 and the data 357 can then be compared with the data 332 for matching. Even though the data 312 is separated into different packet boundaries than data 342, the data 312 can still be matched with data 342 if identical.

FIG. 4 depicts a flow chart for the network device 120 that hashes data in an exemplary implementation of the invention. FIG. 4 begins in step 400. In step 402, the network device 120 receives the next packet. In step 404, the network device 120 processes the packet to identify the flow and the start of the payload. In step 406, the network device 120 restores the state information for the flow including information from the previous packet in the flow. The information from the previous packet in the flow may be hashes, partial hash states, or actual data from the previous packet.

In step 408, the network device 120 determines whether there is unhashed data remaining. If there is no unhashed data remaining, the process ends in step 410. If there is unhashed data remaining, the network device 120 computes byte-wise rolling hashes over packets in the same flow in step 412. A hash is a scheme for providing rapid access to data items which are distinguished by some key. These hashes provide a type of “fingerprinting” over the data to make matching the data easier. One example of a rolling hash is a checksum where the oldest byte in the window is subtracted and new bytes are added. The roiling hash may be over at least one packet. Thus, the rolling hash can run over packet boundaries. When the hash rolls over the end of a packet, the hash state or the remaining portion of the packet (e.g. the last 100 bytes of a packet) that has not been hashed can be saved and retrieved when the next sequential packet for the flow has been received. This hash or the remaining portion of the packet can be saved per flow and can be saved with the state information for the flow. The network device 120 may calculate the hash to the end of the packet.

In one example, cyclic redundancy check (CRC) is used for hashing, where one byte is added and one byte is taken off. CRC provides a stronger fingerprint (e.g. more collision resistant) than checksums. In another example, the hashes are based on the following equation:

new hash=old hash×2×P+new data×Q;

-   -   where P and Q are constants.

In step 414, the network device 120 checks whether the filter criteria have been passed. The network device 120 may use fine and coarse hashes as filters. Fine and coarse hashes are described in further detail in U.S. patent application Ser. No. 11/202,697 (now U.S. Pat. No. 8,370,583) entitled “Network Memory Architecture for Providing Data Based on Local Accessibility” filed on Aug. 12, 2005 and issued on Feb. 5, 2013. If the filter criteria have not been passed, the process returns to step 408. If the filter criteria have been passed, the network device 120 adds the index to the list of possible matches in step 416 and returns to step 408.

FIG. 5 depicts a flow chart for the network device 120 that matches data in an exemplary implementation of the invention. FIG. 5 begins in step 500. In step 502, the network device 120 reads the next entry from the list of possible matches. In step 504, the network device 120 uses the computed hash index to index a hash table. In step 506, the network device 120 checks whether the entry of a possible match is one of the two most likely matches. In determining the most likely match, the network device 120 may check a block of memory that some of the matches are pointing to. In step 508, the network device 120 checks whether the next entry is the end of the list of possible matches. If the next entry is not the end of the list of possible matches, the process returns to step 502.

If the next entry is at the end of the list of possible matches, the network device 120 verifies the match sizes of the most likely and the second most likely matches in step 510. The network device 120 then determines whether both match sizes are small in step 512. The network device 120 advantageously can match data using hashes regardless of how the data was delineated into different packet boundaries.

If both match sizes are small, the network device 120 stores the data in blocks of memory based on the flow in step 514. Thus, as packets are received, the network device 120 sorts and stores the packets by flow, which provides an organization of data by flow making matching the data by hashes easier. For example, writing and retrieving the data for a flow in one portion of memory is easier and faster than retrieving data for a flow that is scattered in various locations in the memory. In some embodiments that have two levels of memory such as RAM and disk, moving data in one portion of disk to RAM can especially save access time to the data. Step 514 is described in more detail below in FIG. 6.

The network device 120 also transmits a store instruction with the data in step 516. The store instruction causes the network device 140 to store the data in the memory 142 of the network device 140. In step 518, the network device 120 then updates the hash table before proceeding to step 522.

If at least one match size is not small, the network device 120 transmits a retrieve instruction with the index of the data for the match with the larger match size in step 520 before proceeding to step 522. The retrieve instruction causes the network device 140 to retrieve the data from its own memory 142. Thus, the data does not have to be transmitted over the communication network 130 but still can be accessed by the network device 140. The network device 120 saves the state information for the flow in step 522. FIG. 5 ends in step 524.

Once data is matched, the network device 120 may match subsequent data by requesting the next packet for the flow. The network device 120 can then iteratively (i.e., going on a “run”) match data and request the next packet for the flow. For example, the network device 120 can match data in a big file until the end of the file. Since the data is stored sequentially by flow in the memory, the network device 120 can just read the next portion of data in the memory. Thus, the data can be coalesced or reconstituted and the one instruction such as a retrieve instruction or store instruction per one packet may be avoided. Store and retrieve instructions are described in further detail in U.S. patent application Ser. No. 11/202,697 (now U.S. Pat. No. 8,370,583) entitled “Network Memory Architecture for Providing Data Based on Local Accessibility” filed on Aug. 12, 2005 and issued on Feb. 5, 2013.

FIG. 6 depicts a flow chart for the network device that writes data in an exemplary implementation of the invention. FIG. 6 depicts a process for storing the data in memory as in step 512 of FIG. 5. FIG. 6 begins in step 600. In step 602, the network device 120 identifies the block of memory for the flow. In one example, the network device 120 checks a table of flows and locations of blocks of memory associated with the flow. In step 604, the network device 120 checks whether the block of memory is identified for the flow. If the block has been identified, the network device 120 proceeds to step 608. If the block has not been identified, the network device 120 allocates a new block of memory for the flow or allocates a block of memory from a list of partially filled blocks of memory in step 606. Initially, one flow can be assigned per block of memory. Once the number of flows exceeds the number of blocks of memory, two flows can be assigned per block of memory. Thus, multiple flows can be assigned per block of memory. In some embodiments, the partially filled blocks are reallocated on a Least Recently Used (LRU) basis.

In step 608, the network device 120 writes the packet data to the block of memory excluding the packet header. In step 610, the network device 120 updates the hash table. In step 612, the network device 120 checks whether the block of memory is full. If the block of memory is not full, the network device 120 proceeds to step 616. If the block of memory is full, the network device 120 allocates a new block of memory for the flow or allocates a block of memory from a list of partially filled blocks of memory in step 614. The block of memory does not have to be completely full. A threshold such as 90% full may be set up to indicate that the block of memory is full.

In step 616, the network device 120 checks whether all the packet data has been written. When the network device 120 determines that the flow finishes, the network device 120 can relinquish the block of memory for the flow, so another flow can use the block of memory. In some embodiments that have two levels of memory such as RAM and disk, when the RAM is first used, the block in the RAM is saved to disk. The network device 120 can relinquish the block of memory by adding the block of memory to the list of partially full blocks of memory. The network device 120 may determine that the flow has ended by a TCP reset or finish (FIN) indicator or another termination message that indicates an explicit ending for the flow. The network device 120 may also determine that the flow has ended for this matching technique when after a period of time (e.g., 10 seconds) there is no activity on the flow.

If all the packet data has not been written, the process returns to step 608 to write the remaining packet data. If all the packet data has been written, FIG. 6 ends in step 618.

FIG. 7 depicts a flow chart for the network device that retrieves data in an exemplary implementation of the invention. FIG. 7 begins in step 700. In step 702, the network device 140 receives and processes a message. In step 704, the network device 140 checks whether a retrieve instruction with an index has been received. If a retrieve instruction with an index has not been received, the process continues to step 708. If a retrieve instruction has been received, the network device 140 retrieves the data from the blocks of memory based on the index in step 706.

In step 708, the network device 140 checks whether a store instruction with data has been received. If the store instruction with data has not been received, the process continues to step 712. If the store instruction with data has been received, the network device 140 stores the data in the blocks of memory based on the flow in step 710. In step 712, the network device 140 forwards the data to the destination. FIG. 7 ends in step 714.

FIG. 8 illustrates a block diagram of the network device 120 in an exemplary implementation of the invention. The network device 140 may have a similar configuration as the network device 120. The network device 120 includes a processor 810, a communications interface 820, and a memory 830, which are all coupled to a system bus 850. The processor 810 is configured to execute executable instructions.

The communications interface 820 is coupled to the communication network 130 and the source 110 via the link 825. The communications interface 820 is configured to exchange communications between the source 110, the communication network 130, and the other elements in the network device 120. In some embodiments, the communications interface 820 may comprise a Local Area Network interface for the source 110 and a Wide Area Network interface for the communication network 130. The memory 830 is any memory configured to store data. Some examples of the memory 830 are storage devices, such as RAM, hard drives, optical drives, flash memory, and magnetic tape. As discussed above, the memory 830 may comprise two levels of memory. One level is a more temporary or short term memory such as RAM, and the other level is a more permanent or long term memory such as disk.

The above-described functions can be comprised of executable instructions that are stored on storage media. The executable instructions can be retrieved and executed by a processor. Some examples of executable instructions are software, program code, and firmware. Some examples of storage media are memory devices, tape, disks, integrated circuits, and servers. The executable instructions are operational when executed by the processor to direct the processor to operate in accord with the invention. Those skilled in the art are familiar with executable instructions, processor(s), and storage media.

The above description is illustrative and not restrictive. Many variations of the invention will become apparent to those of skill in the art upon review of this disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the appended claims along with their full scope of equivalents. 

What is claimed is:
 1. A system for matching data using flow based packet data storage, the system comprising: a communications interface that receives at least one data packet at a network device between a source and a destination, the at least one data packet including data and flow information; and a processor that: identifies a flow between the source and the destination based on the flow information in the at least one data packet; determines whether at least a portion of the data from the received at least one data packet indicates one or more potential matches to data in storage; retrieves a list of possible data matches; determines match sizes of the most likely data match and a second most likely data match by directly comparing packet bytes and matched data bytes; and stores the data from the at least one data packet without a packet header in a block of memory allocated for the flow, or generates a retrieve instruction for the data match depending on the match sizes.
 2. The system of claim 1, wherein the processor moves the storage data between a fast memory and a slow memory.
 3. The system of claim 1, wherein the flow comprises a session between the source and the destination.
 4. The system of claim 1, wherein the processor allocates the block of the memory for the identified flow.
 5. The system of claim 1, wherein the processor transmits the packet data.
 6. The system of claim 1, wherein the block of memory allocated for the flow is allocated from a list of partially filled blocks of memory.
 7. A method for matching data using flow based packet data storage, the method comprising: receiving at least one data packet at a network device between a source and a destination, the at least one data packet including data and flow information; identifying a flow between the source and the destination based on the flow information in of the at least one data packet; determining whether at least a portion of the data from the received at least one data packet indicates one or more potential matches to data in storage; retrieving a list of possible data matches; determining match sizes of the most likely data match and a second most likely data match by directly comparing packet bytes and matched data bytes; and storing the data from the at least one data packet without a packet header in a block of memory allocated for the flow, or generating a retrieve instruction for the data match depending on the match sizes.
 8. The method of claim 7, further comprising moving the storage data between a fast memory and a slow memory.
 9. The method of claim 7, wherein the flow comprises a session between the source and the destination.
 10. The method of claim 7, further comprising allocating the block of the memory for the identified flow.
 11. The method of claim 7, further comprising transmitting the packet data.
 12. The method of claim 7, further comprising allocating the block of memory for the identified flow from a list of partially filled blocks of memory.
 13. A software product for processing packets, the software product comprising: software operational when executed by a processor to direct the processor to receive at least one data packet at a network device between a source and a destination, the at least one data packet including data and flow information; to identify a flow between the source and the destination based on the flow information in the at least one data packet; to determine whether at least a portion of the data from the received at least one data packet indicates one or more potential matches to data in storage; to retrieve a list of possible data matches; to determine match sizes of the most likely data match and a second most likely data match, by directly comparing packet bytes and matched data bytes; and to store the data from the at least one data packet without a packet header in a block of memory allocated for the flow, or to generate a retrieve instruction for the data match depending on the match sizes; and a non-transitory computer-readable storage medium configured to store the software.
 14. The software product of claim 13, wherein the software is operational when executed by the processor to direct the processor to move the storage data between a fast memory and a slow memory.
 15. The software product of claim 13, wherein the flow comprises a session between the source and the destination.
 16. The software product of claim 13, wherein the software is operational when executed by the processor to direct the processor to allocate the block of the memory for the identified flow.
 17. The software product of claim 13, wherein the software is operational when executed by the processor to direct the processor to transmit the packet data.
 18. The software product of claim 13, wherein the block of memory allocated for the flow is allocated from a list of partially filled blocks of memory. 